Orthogonal Global/Local Approximation in N-dimensions: Applications to Input-Output Approximation
نویسندگان
چکیده
Several approximation ideas are presented. The main idea discussed is a weighting function technique that generates a global family of overlapping preliminary approximations whose centroids of validity lie on at the vertices of an N-dimensional grid, with vertices separated by a uniform step h. These preliminary approximations are constructed so they represent the behavior in hypercubes with a volume (2h)N centered on a typical vertex in the grid. These volumes, where the preliminary approximations are valid, overlap by 50% and are averaged in the overlapped hN volume hypercubes, interior to each contiguous set of 2N vertices, to determine final approximations. We establish an averaging method that ensures these final approximations are globally piecewise continuous with adjacent approximations determined in an analogous averaging process, to some prescribed order of partial differentiation. The continuity conditions are enforced by using a unique set of weighting functions in the averaging process. The weight functions are designed to guarantee the global continuity conditions while retaining near complete freedom on the selection of the generating local approximations. However, if the preliminary local approximations are chosen as linear combinations of a set of basis functions constructed such that they are orthogonal with respect to the weight functions, then many advantages are realized, as demonstrated in the paper. Construction of the new set of orthogonal polynomials, and several properties of these functions are novel results presented in this paper. This paper enables a first: piecewise continuous least square approximation in N-dimensions, using orthogonal functions. Several applications are given which provide a basis for optimism on the practical value of the ideas presented. ∗Distinguished Professor, holder of George J. Eppright Chair, Department of Aerospace Engineering, Texas A&M University. †Graduate Research Assistant, Ph. D. Candidate, Dept. of Aerospace Engg., Texas A&M University. ‡Graduate Research Assistant, Ph. D. Candidate, Dept. of Aerospace Engg., Texas A&M University. §Graduate Research Assistant, M.S. Candidate, Dept. of Aerospace Engg., Texas A&M University
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملSUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION
Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...
متن کاملORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS
Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملMultivariate predictions of local reduced-order-model errors and dimensions
This paper introduces multivariate input-output models to predict the errors and bases dimensions of local parametric Proper Orthogonal Decomposition reduced-order models. We refer to these multivariate mappings as the MP-LROM models. We employ Gaussian Processes and Artificial Neural Networks to construct approximations of these multivariate mappings. Numerical results with a viscous Burgers m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004